Routing in the Space Internet: A contact graph routing tutorial

نویسندگان

چکیده

A Space Internet is possible, as long the delay and disruption challenges imposed by space environment are properly tackled. Because these conditions not well addressed terrestrial Internet, more capable Delay-Tolerant Networking (DTN) protocols algorithms being developed. In particular, principles techniques for routing among ground elements spacecraft in near-Earth orbit deep-space enacted Contact Graph Routing (CGR) framework. CGR blends a set of non-trivial algorithm adaptations, operations concepts, time-dynamic scheduling, specific graph models. The complexity that framework suggests need focused discussion to facilitate its direct correct apprehension. To this end, we present an in-depth tutorial collects organizes first-hand experience on researching, developing, implementing, standardizing CGR. Content laid out structure considers planning, route search management, forwarding phases bridging domains. We rely intuitive graphical examples, supporting code material, references flight-grade implementations details where pertinent. hope will serve valuable resource engineers researchers can also apply insights presented here topics DTN research.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating an Indoor space routing graph using semantic-geometric method

The development of indoor Location-Based Services faces various challenges that one of which is the method of generating indoor routing graph. Due to the weaknesses of purely geometric methods for generating indoor routing graphs, a semantic-geometric method is proposed to cover the existing gaps in combining the semantic and geometric methods in this study. The proposed method uses the CityGML...

متن کامل

A Time Dependent Pollution Routing Problem in Multi-graph

This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost.  In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...

متن کامل

A Tutorial on FPGA Routing

Routing is an important step of the process as most of the FPGA’s area is devoted to the interconnect [21], and the interconnection delays are greater than the logic delays of the designed circuit. Therefore an efficient routing algorithm tries to reduce the total wiring area and the lengths of critical-path nets to improve the performance of the circuit; and for this, the router needs the inte...

متن کامل

Energy Efficient Multi Path Routing Protocol in Internet of Things

Internet of things (IoT) is a network with a wide range of smart and physical objects and gadgets that can exchange information with each other. IOT introduces a variety of services that human life is dependent on its secure and accessible activities. These networks face numerous problems in terms of energy consumption and reliable communication to send the correct data. Moreover, the character...

متن کامل

Decentralized Base-Graph Routing for the Quantum Internet

Quantum repeater networks are a fundamental of any future quantum Internet and longdistance quantum communications. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous, multi-level network structure. The level of entanglement between the quantum nodes determines the hop distance and the probability of the existence of an entan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Network and Computer Applications

سال: 2021

ISSN: ['1084-8045', '1095-8592']

DOI: https://doi.org/10.1016/j.jnca.2020.102884